import java.util.Stack;

public class Test {
    public static void main(String[] args) {
        MinStack stack = new MinStack();
        stack.push(1);
        stack.push(0);


    }
    public static void main2(String[] args) {
        MyStack myStack = new MyStack();
        myStack.push(1);
        myStack.push(2);
        myStack.push(3);
        myStack.push(4);
        myStack.push(5);

         int ret1 = myStack.pop();
         int ret2 = myStack.pop();
        System.out.println(ret1);
        System.out.println(ret2);

        int[] a= {1,2,3,4,5};
        int[] b= {4,3,5,1,2};
       boolean flg = myStack.IsPopOrder(a,b);
        System.out.println(flg);
    }
    public static void main1(String[] args) {
        Stack<Integer> stack = new Stack<>();
        stack.push(12);
        stack.push(23);
        stack.push(34);

        //抛出，类似删除
        Integer x = stack.pop();
        System.out.println(x);

        //输出最顶上的元素，但不会删除
        int ret = stack.peek();
        System.out.println(ret);

        ret = stack.peek();
        System.out.println(ret);

        System.out.println(stack.size());


    }
}
